Combinatory recursive objects of all finite types
نویسندگان
چکیده
منابع مشابه
Finite Combinatory Logic with Intersection Types
Combinatory logic is based on modus ponens and a schematic (polymorphic) interpretation of axioms. In this paper we propose to consider expressive combinatory logics under the restriction that axioms are not interpreted schematically but ,,literally”, corresponding to a monomorphic interpretation of types. We thereby arrive at finite combinatory logic, which is strictly finitely axiomatisable a...
متن کاملFinite Combinatory Processes-Formulation 1
Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of ...
متن کاملRecursive Types
Vladimir Gapeyev Michael Y. Levin Benjamin C. Pierce Department of Computer and Information Science University of Pennsylvania fvgapeyev,bcpierce,[email protected] Category: Pearls Abstract Algorithms for checking subtyping between recursive types lie at the core of many modern programming language implementations. But the fundamental theory of these algorithms and how they relate to simpl...
متن کاملTypical property of one class of combinatory objects and estimation from above corresponding combinatory numbers
We investigate properties of families F of subsets of a finite set in a situation where subsets are incomparable by the binary inclusion relation and a) for any A / ∈ F , there is such set A ′ ∈ F that either A ⊂ A ′ or A ′ ⊂ A; b) for any A ∈ F , | A |∈ {k, k + 1}. For these families we introduce one parametre and we show that for almost all families F the value of this parametre is n−1 k. We ...
متن کاملGames for Recursive Types
We present results concerning the solution of recursive domain equations in the category G of games, which is a modiied version of the category presented in AJM94]. New constructions corresponding to lifting and separated sum for games are presented, and are used to generate games for two simple recursive types: the vertical and lazy natural numbers. Recently, the \game semantics" paradigm has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1964
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1964-11245-3